Sparse Signal Estimation by Maximally Sparse Convex Optimization
نویسندگان
چکیده
منابع مشابه
Sparse Recovery by Non - Convex Optimization –
In this note, we address the theoretical properties of ∆p, a class of compressed sensing decoders that rely on ℓ p minimization with p ∈ (0, 1) to recover estimates of sparse and compressible signals from incomplete and inaccurate measurements. In particular, we extend the results of Candès, Romberg and Tao [3] and Wojtaszczyk [30] regarding the decoder ∆ 1 , based on ℓ 1 minimization, to ∆p wi...
متن کاملRestoration of blurred star field images by maximally sparse optimization
The problem of removing blur from, or sharpening, astronomical star field intensity images is discussed. An approach to image restoration that recovers image detail using a constrained optimization theoretic approach is introduced. Ideal star images may be modeled as a few point sources in a uniform background. It is argued that a direct measure of image sparseness is the appropriate optimizati...
متن کاملConvex Optimization Based State Estimation against Sparse Integrity Attacks
We consider the problem of robust estimation in the presence of integrity attacks. There are m sensors monitoring the state and p of them are under attack. The malicious measurements collected by the compromised sensors can be manipulated arbitrarily by the attacker. The classical estimators such as the least squares estimator may not provide a reliable estimate under the so-called (p,m)-sparse...
متن کاملSparse Reinforcement Learning via Convex Optimization
We propose two new algorithms for the sparse reinforcement learning problem based on different formulations. The first algorithm is an off-line method based on the alternating direction method of multipliers for solving a constrained formulation that explicitly controls the projected Bellman residual. The second algorithm is an online stochastic approximation algorithm that employs the regulari...
متن کاملSparse Recovery by Non-convex Optimization -- Instance Optimality
In this note, we address the theoretical properties of ∆p, a class of compressed sensing decoders that rely on lp minimization with 0 < p < 1 to recover estimates of sparse and compressible signals from incomplete and inaccurate measurements. In particular, we extend the results of Candès, Romberg and Tao [4] and Wojtaszczyk [30] regarding the decoder ∆1, based on l 1 minimization, to ∆p with 0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2014
ISSN: 1053-587X,1941-0476
DOI: 10.1109/tsp.2014.2298839